Why the Hardest Logic Puzzle Ever Cannot Be Solved in Less than Three Questions

Rabern and Rabern (2008) and Uzquiano (2010) have each presented increasingly harder versions of 'the hardest logic puzzle ever' (Boolos 1996), and each has provided a BLOCKIN BLOCKIN two-­‐question BLOCKIN BLOCKIN solution BLOCKIN BLOCKIN to BLOCKIN BLOCKIN his BLOCKIN BLOCKIN predecessor's BLOCKIN BLOCKIN puzzle. BLOCKIN BLOCKIN But BLOCKIN BLOCKIN Uzquiano's BLOCKIN BLOCKIN puzzle BLOCKIN BLOCKIN is BLOCKIN BLOCKIN different from the original and different from Rabern and Rabern's in at least one important respect: it cannot be solved in less than three questions. In this paper we solve Uzquiano's puzzle in three questions and show why there is no solution in two. Finally, to cement a tradition, we introduce a puzzle of our own. Recall Uzquiano's puzzle and his guidelines for solving it. whether Random speaks truly or falsely or whether Random speaks at all is a completely random matter. Your task is to determine the identities of A, BLOCKIN